Finitary coding for the sub-critical Ising model with finite expected coding volume
نویسندگان
چکیده
منابع مشابه
Finitary Coding of the Sub-critical Ising Model with Finite Expected Coding Volume
It has been shown by van den Berg and Steif [3] that the sub-critical Ising model on Z is a finitary factor of a finite-valued i.i.d. process. We strengthen this by showing that the factor map can be made to have finite expected coding volume (in fact, stretched-exponential tails), answering a question of van den Berg and Steif [3]. The result holds at any temperature above the critical tempera...
متن کاملAn invariant of finitary codes with finite expected square root coding length
Let p and q be probability vectors with the same entropy h. Denote by B(p) the Bernoulli shift indexed by Z with marginal distribution p. Suppose that φ is a measure preserving homomorphism from B(p) to B(q). We prove that if the coding length of φ has a finite 1/2 moment, then σ2 p = σ 2 q , where σ 2 p = ∑ i pi(− log pi − h)2 is the informational variance of p. In this result, the 1/2 moment ...
متن کاملRegion Based Coding of Volume Data using Finite Mixture Model
The region-based coding of the volume data is proposed in the present paper. Since the volume data is the three dimensional one, the visualization method is needed to display it. The region segmentation is indispensable to visualize the desired portions only. In the proposed method, the region segmentation result is utilized to code the volume data; the contours and the colors of the regions ar...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملQuantum coding with finite resources.
The quantum capacity of a memoryless channel determines the maximal rate at which we can communicate reliably over asymptotically many uses of the channel. Here we illustrate that this asymptotic characterization is insufficient in practical scenarios where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. In practical settings, we should in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2020
ISSN: 1083-6489
DOI: 10.1214/20-ejp420